42 research outputs found
Cut Elimination inside a Deep Inference System for Classical Predicate Logic
Deep inference is a natural generalisation of the one-sided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are difficult or impossible to express in the cut-free sequent calculus and it also allows for a more fine-grained analysis of derivations than the sequent calculus. However, the same freedom also makes it harder to carry out this analysis, in particular it is harder to design cut elimination procedures. In this paper we see a cut elimination procedure for a deep inference system for classical predicate logic. As a consequence we derive Herbrand's Theorem, which we express as a factorisation of derivation
Deep Inference and Symmetry in Classical Proofs
In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they enjoy various new interesting properties. Not only the identity axiom, but also cut, weakening and even contraction are reducible to atomic form. This leads to inference rules that are local, meaning that the effort of applying them is bounded, and finitary, meaning that, given a conclusion, there is only a finite number of premises to choose from. The systems also enjoy new normal forms for derivations and, in the propositional case, a cut elimination procedure that is drastically simpler than the ones for sequent systems
Towards Verifying the Bitcoin-S Library
We try to verify properties of the Bitcoin-S library, a Scala implementation of parts of the Bitcoin protocol. We use the Stainless verifier which supports programs in a fragment of Scala called Pure Scala. Since Bitcoin-S is not written in this fragment, we extract the relevant code from it and rewrite it until we arrive at code that we successfully verify. In that process we find and fix two bugs in Bitcoin-S
Cut-elimination for the mu-calculus with one variable
We establish syntactic cut-elimination for the one-variable fragment of the
modal mu-calculus. Our method is based on a recent cut-elimination technique by
Mints that makes use of Buchholz' Omega-rule.Comment: In Proceedings FICS 2012, arXiv:1202.317
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics,
presented in a formalism based on nested sequents. A nested sequent can be seen
as a tree of traditional single-sided sequents. Our first style of calculi is
what we call "shallow calculi", where inference rules are only applied at the
root node in a nested sequent. Our shallow calculi are extensions of Kashima's
calculus for tense logic and share an essential characteristic with display
calculi, namely, the presence of structural rules called "display postulates".
Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable
for proof search due to the presence of display postulates and other structural
rules. The second style of calculi uses deep-inference, whereby inference rules
can be applied at any node in a nested sequent. We show that, for a range of
extensions of tense logic, the two styles of calculi are equivalent, and there
is a natural proof theoretic correspondence between display postulates and deep
inference. The deep inference calculi enjoy the subformula property and have no
display postulates or other structural rules, making them a better framework
for proof search
北海道における知的障がい者の就労支援に関する一考察
知的障がい者の就労について、北海道及び北海道教育委員会が進めている障が いのある人の就労支援の充実に向けた取組の状況を概観することに加えて、北海道内 の特別支援学校在籍者の約8割を占めている知的障がい特別支援学校の現状や就労支 援の取組について整理した。北海道において障がいある人の就労に大きな役割を果た してきた職親会の設立の経緯やなよろ地方職親会の障がい者雇用の状況やジョブコー チ養成研修の成果をまとめた。以上のことを踏まえて、知的障がい者の就労支援やキ ャリア教育の在り方について考察する
Cut-free sequent systems for temporal logic
AbstractCurrently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary rule. The first and second violate the subformula property and the third has infinitely many premises. We present finitary cut-free invariant-free weakening-free and contraction-free sequent systems for both logics mentioned. In the case of linear time all rules are invertible. The systems are based on annotating fixpoint formulas with a history, an approach which has also been used in game-theoretic characterisations of these logics
Deep Sequent Systems for Modal Logic
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d,t,b,4, 5. They employ a form of deep inference but otherwise stay very close to Gentzen’s sequent calculus, in particular they enjoy a subformula property in the literal sense. No semantic notions are used inside the proof systems, in particular there is no use of labels. All their rules are invertible and the rules cut, weakening and contraction are admissible. All systems admit a straightforward terminating proof search procedure as well as a syntactic cut elimination procedure